Specification and Verification of a Secure Distributed Voting Protocol
نویسندگان
چکیده
The Timed-Buffer Distributed Voting Algorithm (TB-DVA), a secure distributed voting protocol, is introduced and described. A formal specification of the algorithm is developed using Lamport’s specification language TLA+. Then strategies for proving the correctness of the specification using Lamport’s Temporal Logic of Actions (TLA) are discussed.
منابع مشابه
Web Service Choreography Verification Using Z Formal Specification
Web Service Choreography Description Language (WS-CDL) describes and orchestrates the services interactions among multiple participants. WS-CDL verification is essential since the interactions would lead to mismatches. Existing works verify the messages ordering, the flow of messages, and the expected results from collaborations. In this paper, we present a Z specification of WS-CDL. Besides ve...
متن کاملA NEW PROTOCOL MODEL FOR VERIFICATION OF PAYMENT ORDER INFORMATION INTEGRITY IN ONLINE E-PAYMENT SYSTEM USING ELLIPTIC CURVE DIFFIE-HELLMAN KEY AGREEMENT PROTOCOL
Two parties that conduct a business transaction through the internet do not see each other personally nor do they exchange any document neither any money hand-to-hand currency. Electronic payment is a way by which the two parties transfer the money through the internet. Therefore integrity of payment and order information of online purchase is an important concern. With online purchase the cust...
متن کاملDesign of Distributed Voting Systems
Countries like Estonia, Norway or Australia developed electronic voting systems, which could be used to realize parliamentary elections with the help of personal computers and the Internet. These systems are completely different in their design and their way to solve the same problem. In this thesis, we analyze some of the largest real-world systems, describe their building blocks and their gen...
متن کاملDistributed Paillier Plaintext Equivalence Test
Consider the following scenario with N +2 parties, A, B, X1, X2, · · · , XN . Party A has a secret a, party B has a secret b, and party Xi has a secret xi, for i = 1, · · · , N . They want to know if a = b without revealing any information about their secrets. We propose a distributed protocol for this problem based on the Paillier threshold homomorphic encryption scheme with a public broadcast...
متن کاملGSLHA: Group-based Secure Lightweight Handover Authentication Protocol for M2M Communication
Machine to machine (M2M) communication, which is also known as machine type communication (MTC), is one of the most fascinating parts of mobile communication technology and also an important practical application of the Internet of Things. The main objective of this type of communication, is handling massive heterogeneous devices with low network overheads and high security guarantees. Hence, v...
متن کامل